Distributed Symbolic Model Checking for µ-Calculus

Automatic Abstraction Techniques for Propositional µ-calculus Model Checking

An abstraction/reenement paradigm for the full propositional-calculus is presented. No distinction is made between universal or ex-istential fragments. Necessary conditions for conservative veriication are provided, along with a fully automatic symbolic model checking abstraction algorithm. The algorithm begins with conservative veriication of an initial abstraction. If the conclusion is negati...

A Predicate µ-Calculus for Mobile Ambients and Model Checking

A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy

The μ-calculus model-checking problem has been of great interest in the context of concurrent programs. Beyond the need to use symbolic methods in order to cope with the state-explosion problem, which is acute in concurrent settings, several concurrency related problems are naturally solved by evaluation of μ-calculus formulas. The complexity of a naive algorithm for model checking a μ-calculus...

Symbolic model checking for µ-calculus requires exponential time

Model checking [3] is a very popular paradigm for automatic verification of properties of finite state systems like those defined by circuits or communication protocols. A system is interpreted as a finite state labeled transition system or equivalently as a finite Kripke structure. If sys contains k concurrent components, each with m states, then the Kripke structure described by sys may have ...

Efficient Model Checking via the Equational µ-Calculus

This paper studies the use of an equational variant of the modal -calculus as a unified framework for efficient temporal logic model checking. In particular, we show how an expressive temporal logic, CTL , may be efficiently translated into the -calculus. Using this translation, one may then employ -calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and co...